Image Encryption Using Fibonacci-Lucas Transformation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Encryption Using Fibonacci-Lucas Transformation

Secret communication techniques are of great demand since last 3000 years due to the need of information security and confidentiality at various levels of communication such as while communicating confidential personal data , patients’ medical data, countries’ defence and intelligence information, data related to examinations etc. With advancements in image processing research, Image encryption...

متن کامل

Image encryption using P-Fibonacci transform and decomposition

Article history: Received 27 September 2011 Received in revised form 12 November 2011 Accepted 15 November 2011 Available online 28 November 2011

متن کامل

Fibonacci-Lucas densities

Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0− 1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the corresponding configurations. (2000) Mathematics Subject Classification: 11B39, 05A15

متن کامل

New Fibonacci and Lucas primes

Extending previous searches for prime Fibonacci and Lucas numbers, all probable prime Fibonacci numbers Fn have been determined for 6000 < n ≤ 50000 and all probable prime Lucas numbers Ln have been determined for 1000 < n ≤ 50000. A rigorous proof of primality is given for F9311 and for numbers Ln with n = 1097, 1361, 4787, 4793, 5851, 7741, 10691, 14449, the prime L14449 having 3020 digits. P...

متن کامل

Maximal hypercubes in Fibonacci and Lucas cubes

The Fibonacci cube Γn is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained 5 from Γn by removing vertices that start and end with 1. We characterize maximal induced hypercubes in Γn and Λn and deduce for any p ≤ n the number of maximal p-dimensional hypercubes in these graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Cryptography and Information Security

سال: 2012

ISSN: 1839-8626

DOI: 10.5121/ijcis.2012.2312